package com.linwen.excise.niuke._40;

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

/**
 * @author wlw
 * @date 2023/3/5 12:45 PM
 * 字典方式
 * a={abcd...}
 * b={2223...}
 */
public class _21简单密码 {
    private static Map<Character,Character> map = new HashMap();

    static{
        map.put('a','2');
        map.put('b','2');
        map.put('c','2');
        map.put('d','3');
        map.put('e','3');
        map.put('f','3');
        map.put('g','4');
        map.put('h','4');
        map.put('i','4');
        map.put('j','5');
        map.put('k','5');
        map.put('l','5');
        map.put('m','6');
        map.put('n','6');
        map.put('o','6');
        map.put('p','7');
        map.put('q','7');
        map.put('r','7');
        map.put('s','7');
        map.put('t','8');
        map.put('u','8');
        map.put('v','8');
        map.put('w','9');
        map.put('x','9');
        map.put('y','9');
        map.put('z','9');
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String str = scanner.nextLine();
        char[] chars = str.toCharArray();
        for (int i = 0; i < chars.length; i++) {
            if(chars[i]>=0&&chars[i]<=9){
                continue;
            }else if(chars[i]>='a'&&chars[i]<='z'){
                chars[i] = map.get(chars[i]);
            } else if (chars[i]>='A'&&chars[i]<'Z') {
                chars[i] = (char) (chars[i]+33);
            } else if (chars[i]=='Z') {
                chars[i] = (char) (chars[i]+32-25);
            }
        }
        for (char aChar : chars) {
            System.out.print(aChar);
        }

    }
}
